Weak Consistency of P-time Event Graphs
نویسندگان
چکیده
P-time event graphs (P-TEGs) are where the residence time of tokens in places is bounded by specified windows. In this paper, we define a new property PTEGs, called weak consistency. weakly consistent P-TEGs, number times transition can fire before first violation constraint be made as large desired. We show practical implications and, based on previous results graph theory, formulate an algorithm strongly polynomial complexity that verifies it. From algorithm, it possible to determine, pseudo-polynomial time, maximum firings P-TEG.
منابع مشابه
Cycle time of p-time event graphs
The dater equalities constitutes an appropriate tool which allows a linear description of Timed Event Graphs in the field of (max, +) algebra. This paper proposes an equivalent model in the usual algebra which can describe Timed and P-time Event Graphs. Considering 1-periodic behavior, the application of a variant of Farkas’ lemma allows the determination of upper and lower bounds of the produc...
متن کاملFrom extremal trajectories to consistency in P-time Event Graphs Technical report
Using (max, +) algebra, this paper presents a modeling and an analysis method of P-time Event Graphs whose behaviors are defined by lower and upper bound constraints. On the hypothesis of liveness of Event Graphs, consistency is defined by the existence of a temporal trajectory. The extremal trajectories starting from an initial interval are deduced by two dual polynomial algorithms based on a ...
متن کاملPredictive control of Timed Event Graphs with specifications defined by P-time Event Graphs
The aim of this paper is the predictive control of Timed Event Graphs with specifications defined by P-time Event Graphs. We propose a fixed-point approach which leads to a pseudopolynomial algorithm. As the performance of the algorithm is crucial in on-line control, we highlight an important case where the resolution of this first algorithm is efficient. The second technique is a space control...
متن کاملFrom DIOID Algebra to P-Time Event Graphs
Abstract: The (max,+) algebra is usually used to model Timed event graph. In this paper, we show that P-time event graphs which extend Timed event graph, can be modelled using maximum, minimum and addition operations. The result is a new model called interval descriptor system where the time evolution is not strictly deterministic but belongs to intervals. The cycle-time vector allows us to to ...
متن کاملCompromise approach for predictive control of Timed Event Graphs with specifications defined by P-time Event Graphs
In this paper, the aim is to make the predictive control of a plant described by a Timed Event Graph which follows the specifications defined by a P-time Event Graph. We propose a compromise approach between the ideal optimality of the solution and the on-line application of the computed solution when the relevant optimal control cannot be applied for a given computer. The technique is based on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2022
ISSN: ['2405-8963', '2405-8971']
DOI: https://doi.org/10.1016/j.ifacol.2023.01.042